Optimality Conditions in Convex Fuzzy Mathematical Programs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generic Optimality Conditions for Semialgebraic Convex Programs

We consider linear optimization over a nonempty convex semialgebraic feasible region F . Semidefinite programming is an example. If F is compact, then for almost every linear objective there is a unique optimal solution, lying on a unique “active” manifold, around which F is “partly smooth,” and the second-order sufficient conditions hold. Perturbing the objective results in smooth variation of...

متن کامل

Second-order optimality conditions for nonlinear programs and mathematical programs

It is well known that second-order information is a basic tool notably in optimality conditions and numerical algorithms. In this work, we present a generalization of optimality conditions to strongly convex functions of order γ with the help of first- and second-order approximations derived from (Optimization 40(3):229-246, 2011) and we study their characterization. Further, we give an example...

متن کامل

Second-Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints

We study second-order optimality conditions for mathematical programs with equilibrium constraints (MPEC). Firstly, we improve some second-order optimality conditions for standard nonlinear programming problems using some newly discovered constraint qualifications in the literature, and apply them to MPEC. Then, we introduce some MPEC variants of these new constraint qualifications, which are a...

متن کامل

Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications

We consider a difficult class of optimization problems that we call a mathematical program with vanishing constraints. Problems of this kind arise in various applications including optimal topology design problems of mechanical structures. We show that some standard constraint qualifications like LICQ and MFCQ usually do not hold at a local minimum of our program, whereas the Abadie constraint ...

متن کامل

The KKT optimality conditions for constrained programming problem with generalized convex fuzzy mappings

The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: DEStech Transactions on Engineering and Technology Research

سال: 2018

ISSN: 2475-885X

DOI: 10.12783/dtetr/pmsms2018/24884